Fast Decoding of Images With Cryptcodes for Burst Channels

نویسندگان

چکیده

The concept of cryptcoding arises from the need to obtain secure and accurate transmission. This has led an intensive development coding theory cryptography as scientific fields dealing with these problems. To ensure efficient data transmission at same time, is being developed, in which encryption processes are merged into one process. Cryptcodes provide correction a certain number errors transmitted message confidentiality, using only algorithm. In this paper, we consider cryptcodes based on quasigroups, proposed elsewhere. Also, Burst-Cut-Decoding, Burst-4-Sets-Cut-Decoding, FastB-Cut-Decoding FastB-4-Sets-Cut-Decoding algorithms for messages through burst channels have been defined investigated Here, investigate performances images channels. We made experiments different channel parameters compared results obtained decoding cryptcodes. all experiments, considered bit-error probability differences between decoded images. From presented paper can conclude that Fast improve over channel. best by addition, enhance quality images, examined application filter visual unsuccessfully pixels surrounding pixels. be useful satellite digital video broadcasting (DVB-S) schemes.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Universal Decoding for Channels with Memory

A universal decoder for a parametric family of channels is a decoder whose structure depends on the family but not on the individual channel over which transmission takes place, and it yet attains the same random-coding error exponent as the maximum-likelihood receiver tuned to the channel in use. The existence and structure of such decoders is demonstrated under relatively mild conditions of c...

متن کامل

Fast Header Decoding Using Turbo Codes on Rayleigh Fading Channels

In this paper we present a modification of a typical turbo code to allow for the header bits to be decoded much faster than the other bits. This gives the decoder a possibility to discard data packets not addressed to it, and saves time and power since fewer iterations need to be performed to reliably decode the header. The proposed algorithm frequently terminates the first trellis of the turbo...

متن کامل

Universal Decoding for Noisy Channels

A universal decoder for a parametric family of channels is a decoder that for any channel in the family attains the same random coding error exponent as the best decoder for that particular channel. The existence and structure of such decoders is demonstrated under relatively mild conditions of continuity of the channel law with respect to the parameter indexing the family. It is further shown ...

متن کامل

Analysis of soft decision decoding of interleaved convolutional codes over burst channels

We study the performance of a decision feedback decoder (DFD) for convolutional codes over an interleaved burst channel. The DFD adaptively estimates channel reliability information from previous decisions. The effect of ermr propagation, finite interleaving and the length of the initial training sequence is explicitly studied. A binary Gilbert-Elliott channel is used to model the wmla t ion st...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2023

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2023.3278051